SELP: Semi-supervised evidential label propagation algorithm for graph data clustering
نویسندگان
چکیده
منابع مشابه
Semi-supervised Evidential Label Propagation Algorithm for Graph Data
In the task of community detection, there often exists some useful prior information. In this paper, a Semi-supervised clustering approach using a new Evidential Label Propagation strategy (SELP) is proposed to incorporate the domain knowledge into the community detection model. The main advantage of SELP is that it can take limited supervised knowledge to guide the detection process. The prior...
متن کاملActive Semi-supervised Community Detection Algorithm with Label Propagation
Community detection is the fundamental problem in the analysis and understanding of complex networks, which has attracted a lot of attention in the last decade. Active learning aims to achieve high accuracy using as few labeled data as possible. However, so far as we know, active learning has not been applied to detect community to improve the performance of discovering community structure of c...
متن کاملSemi-Supervised Learning by Mixed Label Propagation
Recent studies have shown that graph-based approaches are effective for semi-supervised learning. The key idea behind many graph-based approaches is to enforce the consistency between the class assignment of unlabeled examples and the pairwise similarity between examples. One major limitation with most graph-based approaches is that they are unable to explore dissimilarity or negative similarit...
متن کاملSemi-supervised Relation Extraction with Label Propagation
To overcome the problem of not having enough manually labeled relation instances for supervised relation extraction methods, in this paper we propose a label propagation (LP) based semi-supervised learning algorithm for relation extraction task to learn from both labeled and unlabeled data. Evaluation on the ACE corpus showed when only a few labeled examples are available, our LP based relation...
متن کاملA Unified View of Graph-based Semi-Supervised Learning: Label Propagation, Graph-Cuts, and Embeddings
Recent years have seen a growing number of graph-based semisupervised learning methods. While the literature currently contains several of these methods, their relationships with one another and with other graph-based data analysis algorithms remain unclear. In this paper, we present a unified view of graph-based semi-supervised learning. Our framework unifies three important and seemingly unre...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Approximate Reasoning
سال: 2018
ISSN: 0888-613X
DOI: 10.1016/j.ijar.2017.09.008